Approximate Mean Value Analysis for Closed Queuing Networks with Multiple-Server Stations
نویسندگان
چکیده
Closed Queueing Networks are used in modeling various systems such as FMS, CONWIP Material Control, Computer/Communication Systems, and Health Care. Mean Value Analysis (MVA) is often used to compute the performance measures for these models. For networks with multiple-server stations, the exact MVA algorithm becomes computationally complex and existing approximations introduce high errors. The Schweitzer-Bard (S-B) approximation for MVA is simple and computationally efficient. However it has only been developed for networks with single-server stations. We provide an extension to S-B MVA to enable the analysis of networks with multipleserver stations. Comparison with simulation demonstrates the accuracy of our approach.
منابع مشابه
Discrete - Time Approximation of Themachine Interference Problem with Generally
In this paper we present an approximate discrete-time analysis of the machine interference problem with generally distributed working, failure, and walking times. We analyze the corresponding asymmetric polling system consisting of N separate closed queuing stations (buuer and server), each of which contains a single customer. These queuing stations are attended to by a common server in a cycli...
متن کاملDiscrete-Time Approximation of the Machine Interference Problem with Generally Distributed Failure, Repair, and Walking Times
In this paper we present an approximate discrete time analysis of the machine interference problem with generally distributed working failure and walking times We analyze the corresponding asymmetric polling system consisting of N separate closed queuing stations bu er and server each of which contains a single customer These queuing stations are attended to by a common server in a cyclic manne...
متن کاملMean Value Analysis Approximation for Multiple Server Queueing Networks
An approximation of mean value analysis is presented for queueing networks containing multiple server stations. The approximation is based on the estimation of the conditional marginal probabilities used by the mean residence time formula in mean value analysis. A comparison against classical mean value analysis allows us to determine the accuracy of our algorithm. In all investigated network m...
متن کاملA New Approach for Analyzing Queuing Models of Material Control Strategies in Manufacturing Systems
This paper discusses a new approach for analyzing queuing models of material control strategies such as kanban, CONWIP and POLCA in manufacturing systems. In practice, these strategies regulate the flow of jobs at various stations of the manufacturing system using a combination of card loops and authorization signals. Queuing models of such systems are composed of closed queuing networks corres...
متن کاملAn Extension of Moore's Result for Closed Queuing Networks
In this communication, Moore's result for the normalization constant of a closed queuing network of exponential servers is extended to the case of nondistinct traffic intensities. We then show that this result can be applied to various more general closed and semiclosed queuing networks with a product-form solution. Introduction Substantial progress has been made recently in extending the scope...
متن کامل